Color-bounded hypergraphs, IV: Stable colorings of hypertrees

نویسندگان

  • Csilla Bujtás
  • Zsolt Tuza
چکیده

We consider vertex colorings of hypergraphs in which lower and upper bounds are prescribed for the largest cardinality of a monochromatic subset and/or of a polychromatic subset in each edge. One of the results states that for any integers s ≥ 2 and a ≥ 2 there exists an integer f (s, a)with the following property. If an interval hypergraph admits some coloring such that in each edge Ei at least a prescribed number si ≤ s of colors occur and also each Ei contains a monochromatic subset with a prescribed number ai ≤ a of vertices, then a coloring with these properties exists with at most f (s, a) colors. Further results deal with estimates on the minimum and maximum possible numbers of colors and the time complexity of determining those numbers or testing colorability, for various combinations of the four color bounds prescribed. Many interesting problems remain open. © 2009 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic Symmetric Functions of Hypertrees

The chromatic symmetric function XH of a hypergraph H is the sum of all monomials corresponding to proper colorings of H. When H is an ordinary graph, it is known that XH is positive in the fundamental quasisymmetric functions FS , but this is not the case for general hypergraphs. We exhibit a class of hypergraphs H — hypertrees with prime-sized edges — for which XH is F -positive, and give an ...

متن کامل

On the upper chromatic number of a hypergraph

We introduce the notion of a of a hypergraph, which is a subset of vertices to be colored so that at least two vertices are of the same color. Hypergraphs with both and are called mixed hypergraphs. The maximal number of colors for which there exists a mixed hypergraph coloring using all the colors is called the upper chromatic number of a hypergraph H and is denoted by X(H). An algorithm for c...

متن کامل

Strong Colorings of Hypergraphs

A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. We then consider various parameters that make coloring easier, and give a unified treatment. In particular...

متن کامل

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color in the hyperedge occurs in only one vertex of the hyperedge. In a conflict-free coloring, in every hyperedge of the hypergraph there exists a co...

متن کامل

Partial Colorings of Unimodular Hypergraphs

Combinatorial discrepancy theory asks for vertex-colorings of hypergraphs such that all hyperedges contain all colors in (as good as possible) equal quantity. Unimodular hypergraphs are good in this sense: They (and all their induced subhypergraphs as well) can be two-colored in a way that in each hyperedge the number of vertices in one color deviates from that in the other color by at most one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2010